/**
 * https://leetcode.cn/problems/min-cost-climbing-stairs/description/
 * 746. 使用最小花费爬楼梯
 * 简单, 赖德檀 2024.09.09
 * 动态规划
 */
 class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        int n=cost.size();
        vector<int>dp(n+1,0);
        dp[0]=cost[0];
        dp[1]=cost[1];
        for(int i=2;i<n;i++)
        {
            dp[i]=min(dp[i-1]+cost[i],dp[i-2]+cost[i]);
        }
        return min(dp[n-2],dp[n-1]);
    }
};